Intellektuelt fyrtårn gået bort: Amos Oz (1939–2018)

Proof Labeling Schemes ∗ Amos Korman

This paper addresses the problem of locally verifying global properties. Several natural questions are studied, such as “how expensive is local verification?” and more specifically “how expensive is local verification compared to computation?” A suitable model is introduced in which these questions are studied in terms of the number of bits a node needs to communicate. In addition, approaches a...

Competitive Paging Algorithms AMOS FIAT

The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimize the number of page faults. We develop the marking algorithm, a randomized on-line algorithm for the paging problem. We prove that its expected cost on any sequence of requests is within a factor of 2Hk of optimum. (Where Hk is the kth harmonic number, which is roughly Ink.) The best such facto...

The Oz Programming Model

The Oz Programming Model (OPM) is a concurrent programming model subsuming higher-order functional and object-oriented programming as facets of a general model. This is particularly interesting for concurrent object-oriented programming, for which no comprehensive formal model existed until now. The model can be extended so that it can express encapsulated problem solvers generalizing the probl...

The Oz Programming

Objects in Oz

The programming language Oz integrates the paradigms of imperative, functional and concurrent constraint programming in a computational framework of unprecedented breadth, featuring stateful programming through cells, lexically scoped higher-order programming, and explicit concurrency synchronized by logic variables. Object-oriented programming is another paradigm that provides a set of concept...